#include<vector>
#include<algorithm>
#include<iostream>
using std::vector;
using std::max;


class Solution {
public:
    int rob(vector<int>& nums) {
        if (nums.size() == 1) return nums[0];
        else if (nums.size() == 2) return max(nums[0], nums[1]);
        vector<int> dp(nums.size(), 0);
        dp[0] = nums[0];
        dp[1] = max(nums[0], nums[1]);
        for (int i = 2; i < nums.size(); i++) {
            dp[i] = max(dp[i-1], dp[i-2] + nums[i]);
        }
        return dp[nums.size()-1];
    }

};


int main() {
    int tmp;
    vector<int> nums;
    while (std::cin >> tmp) {
        nums.push_back(tmp);
    }
    for (auto n: nums) {
        std::cout << n << " ";
    }
    std::cout << "\n";
    int result = Solution().rob(nums);
    std::cout << "major: " << result << "\n";
    return 0;

}


